Optimal Clock Allocation for a Class of Timed Automata
نویسندگان
چکیده
We address the problem of allocating a minimal number of clocks to timed automata. To make the problem tractable we assume that all locations are reachable. We identify a fairly general class of timed automata, TADS , for which there is an algorithm whose complexity is quadratic in the size of the graph.
منابع مشابه
Optimal Clock Allocation for Synthesized Acyclic Timed Automata
Having recently proposed a new method for synthesizing timed automata from a set of scenarios, in this paper we propose a novel clock allocation algorithm that minimizes the number of clocks in the constructed timed automata. Scenarios, formally defined as Timed Event Sequences, together with mode graphs are used to describe partial behaviors of real-time systems. Given a set of scenarios in th...
متن کاملA Kleene-Schützenberger Theorem for Weighted Event-Clock Automata
We present a Kleene-Schützenberger-Theorem for weighted event-clock automata, i.e., we show that the class of recognizable timed series coincides with the class of rational timed series. The result generalizes Kleene’s famous theorem and its extensions to the classes of weighted automata and event-clock automata. For proving the theorem, we use the method of a recent work on the class of weight...
متن کاملEvent-Clock Automata: A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a. The class of event-recording automata is, on one hand, expressive enough to model ( nite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the lan...
متن کاملApproximating Continuous Systems by Timed Automata
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed automata. This technique refines commonly-used discrete abstractions which are often too coarse to be useful. The essence of our technique is the partition of the state space into cubes and the allocation of a clock for each dimension. This allows us to ge...
متن کاملOne Clock Priced Timed Automata: Model Checking and Optimal Strategies
In this paper, we consider priced (or weighted) timed automata, and prove various decidability results when the automaton has only one clock: we prove that model checking of WCTL is decidable and that optimal costs in priced timed games are computable. In contrast, it has recently been proved that these problems are undecidable for this model as soon as the system has three clocks.
متن کامل